Decision Making with a Random Walk in a Discrete Time Markov Chain
نویسندگان
چکیده
منابع مشابه
Decision Making with a Random Walk in a Discrete Time Markov Chain
The paper describes a Markov model for multi-criteria and multi-person decision making. The motivation results from a demand observed in the early stages of an innovation process. Here, many alternatives need to be evaluated by several decision makers with respect to several criteria. The model derivation and description can be split into the evaluation process and the decision process. The pai...
متن کاملA Random Walk with Exponential Travel Times
Consider the random walk among N places with N(N - 1)/2 transports. We attach an exponential random variable Xij to each transport between places Pi and Pj and take these random variables mutually independent. If transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملArrival probability in the stochastic networks with an established discrete time Markov chain
The probable lack of some arcs and nodes in the stochastic networks is considered in this paper, and its effect is shown as the arrival probability from a given source node to a given sink node. A discrete time Markov chain with an absorbing state is established in a directed acyclic network. Then, the probability of transition from the initial state to the absorbing state is computed. It is as...
متن کاملDiscrete Time Markov Chain (DTMC)
A. A stochastic process is a collection of random variables {X t , t ∈ T }. B. A sample path or realization of a stochastic process is the collection of values assumed by the random variables in one realization of the random process, e.g. C. The state space is the collection of all possible values the random variables can take on, i.e. it is the sample space of the random variables. For example...
متن کاملa random walk with exponential travel times
consider the random walk among n places with n(n - 1)/2 transports. we attach an exponential random variable xij to each transport between places pi and pj and take these random variables mutually independent. if transports are possible or impossible independently with probability p and 1-p, respectively, then we give a lower bound for the distribution function of the smallest path at point log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SNE Simulation Notes Europe
سال: 2010
ISSN: 2305-9974,2306-0271
DOI: 10.11128/sne.20.tn.09989